Thesis Proposal Stacked Graphical Learning

نویسندگان

  • Zhenzhen Kou
  • William W. Cohen
  • Robert F. Murphy
چکیده

Traditional machine learning methods assume that instances are independent while in reality there are many relational datasets, such as hyperlinked web pages, scientific literatures with dependencies among citations, social networks, and more. Recent work on graphical models has demonstrated performance improvement on relational data. In my thesis I plan to study a meta-learning scheme called stacked graphical learning. Given a relational template, the stacked graphical model augments a base learner by expanding one instance’s features with predictions on other related instances. The stacked graphical learning is efficient, capable of capturing dependencies easily, and can be constructed based on any kind of base learner. The thesis proposal describes the algorithm for stacked graphical models, evaluates the approach on some real world data, and compares the performance to other methods. For my thesis I plan to explore more of the strengths and weaknesses of the approach, and apply it to tasks in the SLIF system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stacked Graphical Learning

In reality there are many relational datasets in which both features of instances and the relationships among the instances are recorded, such as hyperlinked web pages, scientific literature with citations, and social networks. Collective classification has been widely used to classify a group of related instances simultaneously. Recently there have been several studies on statistical relationa...

متن کامل

Generalized Stacked Sequential Learning

In many supervised learning problems, it is assumed that data is independent and identically distributed. This assumption does not hold true in many real cases, where a neighboring pair of examples and their labels exhibit some kind of relationship. Sequential learning algorithms take benefit of these relationships in order to improve generalization. In the literature, there are different appro...

متن کامل

Stacked Graphical Learning: Learning in Markov Random Fields using Very Short Inhomogeneous Markov Chains

We described stacked graphical learning, a meta-learning scheme in which a base learner is augmented by expanding one instance’s features with predictions on other related instances. The stacked graphical learning is efficient, especially during inference, capable of capturing dependencies easily, and can be constructed based on any kind of base learner. In experiments on two classification pro...

متن کامل

Stacked Graphical Learning: Learning in Markov Random Fields using Very Short Inhomogeneous Markov Chains

We described stacked graphical learning, a meta-learning scheme in which a base learner is augmented by expanding one instance’s features with predictions on other related instances. The stacked graphical learning is efficient, especially during inference, capable of capturing dependencies easily, and can be constructed based on any kind of base learner. In experiments on two classification pro...

متن کامل

Stacked Graphical Models for Efficient Inference in Markov Random Fields

In collective classification, classes are predicted simultaneously for a group of related instances, rather than predicting a class for each instance separately. Collective classification has been widely used for classification on relational datasets. However, the inference procedure used in collective classification usually requires many iterations and thus is expensive. We propose stacked gra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006